Galois Graphs: Walks, Trees and Automorphisms
نویسنده
چکیده
Given a symmetric polynomial 8(x, y) over a perfect field k of characteristic zero, the Galois graph G(8) is defined by taking the algebraic closure k̄ as the vertex set and adjacencies corresponding to the zeroes of 8(x, y). Some graph properties of G(8), such as lengths of walks, distances and cycles are described in terms of 8. Symmetry is also considered, relating the Galois group Gal(k̄/k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.
منابع مشابه
ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملRandom Walks on Infinite Graphs and Groups — a Survey on Selected Topics
Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks on graphs 6 E. Harmonic and superharmonic functions 6 3. Spectral radius, amenability and law of large numbers 6 A. Spectral radius, isoperimetric inequalities and growth 6 B. Law of large numbers 9 ...
متن کاملLocalization of Discrete Time Quantum Walks on the Glued Trees
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the qua...
متن کاملOn a conjecture on k-walks of graphs
In this paper we give examples to show that a conjecture on k-walks of graphs, due to B. Jackson and N.C. Wormald, is false. We also give a maximum degree condition for the existence of k-walks and k-trees in 2-connected graphs.
متن کاملBounds on the number of closed walks in a graph and its applications
Using graph-theoretical techniques, we establish an inequality regarding the number of walks and closed walks in a graph. This inequality yields several upper bounds for the number of closed walks in a graph in terms of the number of vertices, number of edges, maximum degree, degree sequence, and the Zagreb indices of the graph. As applications, we also present some new upper bounds on the Estr...
متن کامل